Curriculum Vitae
				 ROBERT W. FLOYD


1.  BIOGRAPHICAL AND PERSONAL INFORMATION


	Born June 8, 1936, New York City, New York;
	U. S. citizen; Social Security number 422-42-1585;
	Divorced; children:  Susan - December 1960, 
			     Michael - July 1962,
			     Sean - June 1971.

2.  ACADEMIC HISTORY

	University of Chicago, 1951-1955, part time 1956-1958;
	  B.A. (Liberal Arts) 1953, B.S. (Physics) 1958.

3.  EMPLOYMENT RECORD

	Electrical Engineer, Electronic Tube Plant, Westinghouse Electric,
	  Elmira, New York, 1955-56.
	Computer Operator, computer programmer and analyst, Armour Research
	  Foundation, Chicago, Illinois (now IIT Research Institute),
	  1956-62.
	Senior Project Scientist, Computer Associates, Boston, Massachusetts,
	  (now a Division of Applied Data Research), 1962-65.
	Associate Professor, Computer Science Department, Carnegie-Mellon
	  University, Pittsburgh, Pennsylvania, 1965-68.
	Associate Professor, Computer Science Department, Stanford
	  University, 1968-70.
	Full Professor, Computer Science Department, Stanford University,
	  1970-present.
	Chairman of Computer Science Department, Stanford University
	  1973-76.

4.  PROFESSIONAL SOCIETIES

	Association for Computing Machinery
	American Association for the Advancement of Science

5.  HONORS AND AWARDS

	Ford Foundation pre-induction scholarship, 1951-1953.
	General University scholarships, 1953-1955.
	American Academy of Arts and Sciences.
	Guggenheim Fellow, 1976-1977.
	Turing Award from Association for Computing Machinery, l978.


6.  PUBLICATIONS


	"A formal representation of the interference between several pulse
trains," (with B. Ebstein), Conference on Radio Interference and Electronic
Compatibility, 1958.

	"Remarks on a recent paper 'Elimination of special functions from
differential equations'," <<Comm. ACM>, 2 (1959), 21.

	"A note on rational approximation," <<Math. Computation>, 14 (1960),
72-73.

	"An algorithm defining Algol assignment statements," <<Comm. ACM>, 3
(1960), 170-171.

	"Rational interpolation by continued fractions," Algorithm,
<<Comm. ACM>, 3 (1960), 508.

	"An algorithm for coding efficient arithmetic operations," <<Comm.
ACM>, 4 (1961), 42-51.

	"A note on mathematical induction on phrase structure grammars,"
<<Information and Control>, 4 (1961), 353-358.

	"A descriptive language for symbol manipulation," <<J. ACM>, 8
(1961), 579-584.

	"Advanced studies of computer programming," Armour Research 
Foundation, Chicago, Illinois, (1961), 111 pp.

	"Ancestor," Algorithm, <<Comm. ACM>, 5 (1962), 344.

	"Shortest path," Algorithm, <<Comm. ACM>, 5 (1962), 345.

	"Treesort," Algorithm, <<Comm. ACM>, 5 (1962), 434.

	"On the nonexistence of a phrase structure grammar for ALGOL 60,"
<<Comm. ACM>, 5 (1962), 483-484.

	"On ambiguity in phrase structure languages," <<Comm. ACM>, 5 (1962),
526-534.

	"Syntactic analysis and operator precedence," <<J. ACM>, 10 (1963),  
316-333.

	"Bounded context syntactic analysis," <<Comm. ACM>, 7 (1964), 62-67.

	"Treesort 3," Algorithm, <<Comm. ACM>, 7 (1964), 701.

	"The syntax of programming languages -- a survey," <<IEEE 
Transactions on Electronic Computers>, EC-13 (1964), 346-353.  Reprinted in
Saul Rosen, <<Programming Languages and Systems>, McGraw-Hill, 1967, 342-
358.

	"New proofs of old theorems in logic and formal linguistics,"
Research report, Carnegie-Mellon University, November 1966.

	"Assigning meanings to programs," <<Proceedings of Symposia in
Applied Mathematics>, 19, Amer. Math. Soc., 1967, 19-32.

	"Nondeterministic algorithms," <<J. ACM>, 14 (1967), 636-655.

	"Improved constructions for the Bose-Nelson sorting problem,"
(with D. E. Knuth), <<Amer. Math. Soc. Notices>, 14 (1967), 283.

	"The verifying compiler," Computer Science Research Review,
Carnegie-Mellon University, December 1967, 18-19.

	"An interpretation-oriented theorem prover over integers," (with
James King), <<Journal of Computer and System Sciences>, 6, 4 (August
1972), 305-323.

	"Toward interactive design of correct programs," <<Information
Processing 71>, North-Holland Publishing Company, (1972), 7-10.

	"Permuting information in idealized two-level storage," <<Complexity
of Computer Computations>, (ed. R. E. Miller), Plenum Press (1972), 105-109.

	"The Bose-Nelson sorting problem," (with D. E. Knuth), in <<A Survey
of Combinatorial Theory>, (eds. J. N. Srivastava et al), North-Holland
Publishing Co., (1973), 163-172.

	"Time bounds for selection," (with M. Blum, V. Pratt, R. Rivest,
R. Tarjan), <<Journal of Computer and System Sciences>, 7, 4 (August 1973),
448-461.

	"A linear time two tape merge," (with A. J. Smith), <<Information
Processing Letters>, 2 (1974), 123-125.

	"Expected time bounds for selection," (with R. Rivest), <<Comm. ACM>,
18, 3 (March 1975), 165-172.

	"Algorithm 489:  The algorithm SELECT -- for finding the i-th
smallest of n elements [M1]," (with R. Rivest), Algorithm, <<Comm. ACM>, 18,
3 (March 1975), 173.

	"The exact time required to perform generalized addition,"
Sixteenth Annual Symposium on Foundations of Computer Science, IEEE Computer
Society, October 1975.

	"An adaptive algorithm for spatial greyscale," (with L. Steinberg),
<<Proceedings of the Society for Information Display>, 17/2 (Second Quarter
1976).


	"Exact and Approximate Membership Testers," (with Larry Carter, John
Gill, George Markovsky, and Mark Wegman), Tenth Annual ACM Symposium on The
Theory of Computing, ACM, New York, 1978.